搜索资源列表
beibao.rar
- 背包问题最优算法
knapsack.rar
- 用GAlib库实现的解决0/1背包问题的遗传算法程序源代码。
thesis2000_fangqi
- 算法分析和设计的主要原理,动态规划 贪心算法 背包问题的实例-algorithm analysis and design of the main principle of dynamic programming greedy algorithm examples knapsack problem
贪心方法
- 贪心方法解0/1背包问题,构造一个物品类,调用类方法对背包进行排序,核心代码已给出-greedy method for 0 / 1 knapsack problem, a structural categories of goods, the category called right backpack method for sequencing, the core code has been given
my0-1knapsack
- 给定n 个物品, 物品i重为wi 并且价值为 vi ，背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ． 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum tot
背包问题之贪婪算法求解C语言源代码
- 其实原来的程序也是采用了贪婪算法，不过下面程序中的beibao1函数采用了贪婪算法的另一种写法，beibao函数是以前的代码，用来比较两种算法-fact, the original procedure is used in the greedy algorithm, but the procedures below beibao1 function of the greedy algorithm used another way, beibao function of the previous
id5
- 介绍动态规划方法在解决背包问题、图象压缩、矩阵乘法链、最短路径、无交叉子集和元件折叠等方面的应用。-on dynamic programming methods in solving knapsack problem, image compression, the matrix multiplication chains, the shortest path, non-overlapping subsets of folding and components such applications.
PSO-bag
- 用粒子群算法解决背包问题，能得到比较有效的结果-Particle swarm algorithm to solve knapsack problem, the results can be more effective
simknap_rec
- 简化背包算法，实用于大学生学习模拟使用，实现简单的背包问题-Simplify the knapsack algorithm, useful in the simulation students learn to use, simple knapsack problem
d66906376b80
- 遗传算法解决TSP背包问题的源代码，包涵MATLAB程序和详尽文字算法说明-Knapsack problem genetic algorithm source code for TSP, bear with MATLAB algorithms procedures and detailed text descr iption
01
- 01背包问题，利用的是动态规划的思想，不是改进的01背包算法-01 knapsack problem, the use of dynamic programming is the idea, not the 01 knapsack algorithm to improve
beibaoqiujie
- 用遗传算法计算背包问题的经典程序,word的文档里面有说明和程序。-Knapsack problem using genetic algorithm the classic program, word document which has instructions and procedures.
PSO-for-knapsack-problem
- pso算法在背包问题中的matlab程序。-pso algorithm in the knapsack problem in the matlab program.
背包问题
- python的0-1背包算法实现，包含如何求出路径，还有算法流程图(Python 0-1 knapsack algorithm implementation, including how to find the path, and the algorithm flow chart)
01beibao_fenzhijiexian
- 分治法实现01背包问题，输入为即将放入背包的物品的重量和对应价值的数组，输出为放置物品的最优方案(Realization of 01 knapsack problem by divide and conquer method)
12.8 01背包练习题
- java 动态规划之0-1背包问题代码详解，详细注释(0-1 knapsack problem dynamic programming code Xiangjie)
01packeg
- 01背包问题的一种实现算法。根据需要设置Weight、Value和Capacity。(01 an algorithm for the realization of the knapsack problem. Weight, Value, and Capacity are set up as required.)
0-1
- 利用动态规划实现0-1背包问题，文件包含源代码，解释说明及测试样例(Dynamic programming to achieve 0-1 knapsack problem.)
背包九讲
- 经典DP 背包问题，九讲背包入门，适合新手或入门者学习动态规划(The classic DP knapsack problem, the introduction of knapsack, is suitable for beginners or beginners to learn dynamic programming.)